An elementary proof of a conjecture on Graph-Automorphism
نویسندگان
چکیده
منابع مشابه
An elementary proof of the reconstruction conjecture
The reconstruction conjecture states that the multiset of vertex-deleted subgraphs of a graph determines the graph, provided it has at least 3 vertices. This problem was independently introduced by Stanis law Ulam (1960) and Paul Kelly (1957). In this paper, we prove the conjecture by elementary methods. It is only necessary to integrate the Lenkle potential of the Broglington manifold over the...
متن کاملAn Elementary Proof of Hawkes’s Conjecture on Galton-watson Trees
In 1981, J. Hawkes conjectured the exact form of the Hausdorff gauge function for the boundary of supercritical Galton-Watson trees under a certain assumption on the tail at infinity of the total mass of the branching measure. Hawkes’s conjecture has been proved by T. Watanabe in 2007 as well as other precise results on fractal properties of the boundary of Galton-Watson trees. The goal of this...
متن کاملElementary Proof of MacMahon’s Conjecture
Major Percy A. MacMahon’s first paper on plane partitions [4] included a conjectured generating function for symmetric plane partitions. This conjecture was proven almost simultaneously by George Andrews and Ian Macdonald, Andrews using the machinery of basic hypergeometric series [1] and Macdonald employing his knowledge of symmetric functions [3]. The purpose of this paper is to simplify Macd...
متن کاملAn Elementary Proof of Markoff Conjecture for Prime Powers
We present a very elementary proof of the uniqueness of Markoff numbers which are prime powers, in the sense that it uses nothing on algebraic number theory or hyperbolic geometry.
متن کاملA Proof of the Bounded Graph Conjecture
Let σ, τ : N→N be two sequences of natural numbers. We say that σ dominates τ if σ(n) τ(n) for every n greater than some n0 ∈ N. Now let G be an infinite graph, and assume the vertices of G are labelled with natural numbers, say by f : V (G)→N. Then each ray (one-way infinite path) R = x0x1 . . . in G gives rise to a sequence τR := (f(x0), f(x1), . . .); we say that σ dominates R if σ dominates...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2017
ISSN: 1571-0653
DOI: 10.1016/j.endm.2017.11.020